Hierarchical QR factorization algorithms for multi-core clusters
نویسندگان
چکیده
0167-8191/$ see front matter 2013 Elsevier B.V. All rights reserved. http://dx.doi.org/10.1016/j.parco.2013.01.003 q A preliminary version of part of the results presented in this paper appears in IPDPS’2012. ⇑ Corresponding author. Address: Laboratoire LIP, ENS Lyon, 69364 Lyon Cedex 07. Tel.: +33 472728586; fax: +33 472728080. E-mail address: [email protected] (Y. Robert). Jack Dongarra , Mathieu Faverge , Thomas Hérault , Mathias Jacquelin , Julien Langou , Yves Robert a,d,⇑
منابع مشابه
Tiled Algorithms for Matrix Computations on Multicore Architectures
Current computer architecture has moved towards the multi/many-core structure. However, the algorithms in the current sequential dense numerical linear algebra libraries (e.g. LAPACK) do not parallelize well on multi/many-core architectures. A new family of algorithms, the tile algorithms, has recently been introduced to circumvent this problem. Previous research has shown that it is possible t...
متن کاملImplementing a Systolic Algorithm for QR Factorization on Multicore Clusters with PaRSEC
This article introduces a new systolic algorithm for QR factorization, and its implementation on a supercomputing cluster of multicore nodes. The algorithm targets a virtual 3D-array and requires only local communications. The implementation of the algorithm uses threads at the node level, and MPI for inter-node communications. The complexity of the implementation is addressed with the PaRSEC s...
متن کاملEnhancing Parallelism of Tile QR Factorization for Multicore Architectures
To exploit the potential of multicore architectures, recent dense linear algebra libraries have used tile algorithms, which consist of scheduling a Directed Acyclic Graph (DAG) of fine granularity tasks where nodes represent tasks, either panel factorization or update of a block-column, and edges represent dependencies among them. Although past approaches already achieve high performance on mod...
متن کاملPerformance Predictions of Multilevel Communication Optimal LU and QR Factorizations on Hierarchical Platforms
In this paper we study the performance of two classical dense linear algebra algorithms, the LU and the QR factorizations, on multilevel hierarchical platforms. We note that we focus on multilevel QR factorization, and give a brief description of the multilevel LU factorization. We first introduce a performance model called Hierarchical Cluster Platform (Hcp), encapsulating the characteristics ...
متن کاملTall and Skinny QR Matrix Factorization Using Tile Algorithms on Multicore Architectures
To exploit the potential of multicore architectures, recent dense linear algebra libraries have used tile algorithms, which consist in scheduling a Directed Acyclic Graph (DAG) of tasks of fine granularity where nodes represent tasks, either panel factorization or update of a block-column, and edges represent dependencies among them. Although past approaches already achieve high performance on ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Parallel Computing
دوره 39 شماره
صفحات -
تاریخ انتشار 2013